Large Histogram Computation for Normalized Mutual Information on GPU
نویسندگان
چکیده
This poster presents two GPU implementations of normalized mutual information (NMI) for a two-step image registration used in version 1.0 of the Photogrammetric Registration of Imagery from Manned and Unmanned Systems (PRIMUS) pipeline [1]. This fully-automated, sensor-agnostic application enables the precise geolocation of aerial and orbital imagery, a fundamental building block for accurate geographic applications and data analysis. In PRIMUS, NMI is used for coarse and refined alignment of multi-spectral imagery, referred to as global localization and registration, respectively. However, different algorithms have been implemented in CUDA to fit the different characteristics of each alignment. Although NMI is commonly used to register images from different modalities [2], GPU implementations usually focus on single coefficient computation leveraging entropy approximation calculus or generating histograms with a limited number of bins [3][4][5]. However, for our use case, we need to generate the full joint-histogram of 65,536 bins to mitigate the loss of accuracy due to compression that occurs when reducing the image-intensity range from 16-bit to 8bit, needed to leverage most of the functions in OpenCV library. It is also important to note that our use case involves a mask that indicates valid pixels that are considered for the NMI coefficient computation this adds to the computational complexity and uniqueness of our solution but can significantly improve its overall accuracy. Our preliminary approaches target the NVIDIA Tesla K80, not only to leverage the global memory available on the GPU but also its queue manager, which lends themselves well to our specific problem.
منابع مشابه
High-Dimensional Normalized Mutual Information for Image Registration Using Random Lines
Mutual information has been successfully used as an effective similarity measure for multimodal image registration. However, a drawback of the standard mutual information-based computation is that the joint histogram is only calculated from the correspondence between individual voxels in the two images. In this paper, the normalized mutual information measure is extended to consider the corresp...
متن کاملEfficient Histogram Algorithms for NVIDIA CUDA Compatible Devices
We present two efficient histogram algorithms designed for NVIDIA’s compute unified device architecture (CUDA) compatible graphics processor units (GPUs). Our algorithm can be used for parallel computation of histograms on large data-sets and for thousands of bins. Traditionally histogram computation has been difficult and inefficient on the GPU. This often means that GPU-based implementation o...
متن کامل3D Registration Based on Normalized Mutual Information: Performance of CPU vs. GPU Implementation
Medical image registration is time-consuming but can be sped up employing parallel processing on the GPU. Normalized mutual information (NMI) is a well performing similarity measure for performing multi-modal registration. We present CUDA based solutions for computing NMI on the GPU and compare the results obtained by rigidly registering multi-modal data sets with a CPU based implementation. Ou...
متن کامل3D Registration based on Normalized Mutual Information
Medical image registration is time-consuming but can be sped up employing parallel processing on the GPU. Normalized mutual information (NMI) is a well performing similarity measure for performing multi-modal registration. We present CUDA based solutions for computing NMI on the GPU and compare the results obtained by rigidly registering multi-modal data sets with a CPU based implementation. Ou...
متن کاملCorrelation ratio based volume image registration on GPUs
Volume image registration remains one of the best candidates for Graphics Processing Unit (GPU) acceleration because of its enormous computation time and plentiful data-level parallelism. However, an efficient GPU implementation for image registration is still challenging due to the heavy utilization of expensive atomic operations for similarity calculations. In this paper, we first propose fiv...
متن کامل